A Novel Unconditionally Secure Oblivious Polynomial Evaluation Protocol
نویسنده
چکیده
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P , and a receiver whose input is a value x. At the end of the protocol, the receiver learns P (x) and nothing more about P , while the sender remains oblivious of both x and P (x). It is used as a primitive in many applications including protocols for private comparison of data, for mutually authenticated key exchange based on (possibly weak) passwords, and for anonymous coupons. In this paper, we describe a novel unconditionally secure oblivious polynomial evaluation protocol. Keywords—Multi-Party Computation, Oblivious Transfer, Oblivious Polynomial Evaluation.
منابع مشابه
Cryptanalysis on a novel unconditionally secure oblivious polynomial evaluation protocol
Vanishree et.al proposed a novel unconditionally oblivious polynomial evaluation protocol and they claimed that can fulfill both sender and receiver’s security. Here, this protocol is cryptanalyzed. We find that it has a fatal fault which cannot implement the receiver’s security at all and show the detail analyzing process. Keywords oblivious polynomial evaluation, oblivious transfer, multi-par...
متن کاملUnconditionally secure quantum oblivious transfer
Based on quantum uncertainty and quantum entanglement, an quantum allor-nothing oblivious transfer protocol is proposed. It is illustrated in detail that the protocol is unconditionally secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. The full utilization of the entanglement makes the protocol different from previous insecure ones, thus ...
متن کاملQuantum Key Distribution and String Oblivious Transfer in Noisy Channels
We prove the unconditional security of a quantum key distribution (QKD) protocol on a noisy channel against the most general attack allowed by quantum physics. We use the fact that in a previous paper we have reduced the proof of the unconditionally security of this QKD protocol to a proof that a corresponding Quantum String Oblivious Transfer (String-QOT) protocol would be unconditionally secu...
متن کاملBit Commitment, Oblivious Transfer, and Mental Poker without One-way Functions
While it is fairly obvious that a secure (bit) commitment between two parties is impossible without a one-way function, we show that it is possible if the number of parties is at least 3. Then we show how our unconditionally secure (bit) commitment scheme for 3 parties can be used to arrange an unconditionally secure (bit) commitment between just two parties if they use a “dummy” (e.g., a compu...
متن کاملSequentially Composable Information Theoretically Secure Oblivious Polynomial Evaluation
Oblivious polynomial evaluation (OPE) consists of a twoparty protocol where a sender inputs a polynomial P , and a receiver inputs a single value i. At the end of the protocol, the sender learns nothing and the receiver learns P (i). This paper deals with the problem of oblivious polynomial evaluation under an information-theoretical perspective, which is based on recent definitions of Uncondit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009